The crossing number of the hexagonal graph H_{3,n}
نویسندگان
چکیده
منابع مشابه
On the Crossing Number of the Complete Tripartite Graph
Abstract: The well known Zarankiewicz’ conjecture is said that the crossing number of the complete bipartite graph Km,n (m ≤ n) is Z(m, n), where Z(m,n) = ⌊ m 2 ⌋⌊ 2 ⌋⌊ 2 ⌋ ⌊ 2 ⌋ (for any real number x, ⌊x⌋ denotes the maximal integer no more than x). Presently, Zarankiewicz’ conjecture is proved true only for the case m ≤ 6. In this article, the authors prove that if Zarankiewicz’ conjecture h...
متن کاملThe relationship between the distinguishing number and the distinguishing index with detection number of a graph
This article has no abstract.
متن کاملParallel Computation of the Minimal Crossing Number of a Graph
Determining the crossing number of a graph is an important problem with applications in areas such as circuit design and network connguration. In this paper we present the rst parallel algorithm for solving this combinatorial optimization problem. This branch-and-bound algorithm, which adds and deletes crossings in an organized fashion, presents us with the opportunity to verify many conjecture...
متن کاملDeciding Parity of Graph Crossing Number∗
We prove that it is NP-hard to determine whether the crossing number of an input graph is even or odd.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2019
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2092